Average-case analysis of the bin-packing problem with general cost structures

1997 ◽  
Vol 44 (7) ◽  
pp. 673-686 ◽  
Author(s):  
Julien Bramel ◽  
WanSoo T. Rhee ◽  
David Simchi-Levi
Keyword(s):  
Bin Packing ◽  
Case Analysis ◽  
Packing Problem ◽  
Average Case Analysis ◽  
Average Case ◽  
Cost Structures ◽  
Bin Packing Problem

Multidimensional on-line bin-packing: An algorithm and its average-case analysis

1993 ◽  
Vol 48 (3) ◽  
pp. 121-125 ◽  
Author(s):  
Ee-Chien Chang ◽  
Weiguo Wang ◽  
Mohan S. Kankanhalli
Keyword(s):  
Bin Packing ◽  
Case Analysis ◽  
Average Case Analysis ◽  
Average Case ◽  
On Line

scholarly journals On a generalized problem of bin packing

2015 ◽  
Vol 1 (2) ◽  
pp. 14-21
Author(s):  
Nguyen Trong
Keyword(s):  
Bin Packing ◽  
Heuristic Algorithms ◽  
Case Analysis ◽  
Packing Problem ◽  
Worst Case Analysis ◽  
Worst Case ◽  
Np Completeness ◽  
Bin Packing Problem

A generalization of the bin packing problem, called the DTMR problem is studied. The NP-completeness of  DTMR is proved. Three heuristic algorithms-the CNN, the CHT and the CSX are described and the worst-case analysis of them are given. Some applications of the DTMR are shown.

Average Case Analysis of Bounded Space Bin Packing Algorithms

Algorithmica ◽  
2007 ◽  
Vol 50 (1) ◽  
pp. 72-97 ◽  
Author(s):  
Nir Naaman ◽  
Raphael Rom
Keyword(s):  
Bin Packing ◽  
Case Analysis ◽  
Average Case Analysis ◽  
Average Case ◽  
Bounded Space
Sign in / Sign up

Export Citation Format

Share Document